Bounds on the differentiating-total domination number of a tree
نویسندگان
چکیده
منابع مشابه
Bounds on the differentiating-total domination number of a tree
Given a graphG = (V , E)with no isolated vertex, a subset S of V is called a total dominating set of G if every vertex in V is adjacent to a vertex in S. A total dominating set S is called a differentiating-total dominating set if for every pair of distinct vertices u and v in V , N[u] ∩ S ≠ N[v] ∩ S. The minimum cardinality of a differentiating-total dominating set of G is the differentiating-...
متن کاملLower bounds on the signed (total) $k$-domination number
Let $G$ be a graph with vertex set $V(G)$. For any integer $kge 1$, a signed (total) $k$-dominating functionis a function $f: V(G) rightarrow { -1, 1}$ satisfying $sum_{xin N[v]}f(x)ge k$ ($sum_{xin N(v)}f(x)ge k$)for every $vin V(G)$, where $N(v)$ is the neighborhood of $v$ and $N[v]=N(v)cup{v}$. The minimum of the values$sum_{vin V(G)}f(v)$, taken over all signed (total) $k$-dominating functi...
متن کاملBounds on the restrained Roman domination number of a graph
A {em Roman dominating function} on a graph $G$ is a function$f:V(G)rightarrow {0,1,2}$ satisfying the condition that everyvertex $u$ for which $f(u) = 0$ is adjacent to at least one vertex$v$ for which $f(v) =2$. {color{blue}A {em restrained Roman dominating}function} $f$ is a {color{blue} Roman dominating function if the vertices with label 0 inducea subgraph with no isolated vertex.} The wei...
متن کاملUpper Bounds on the Total Domination Number
A total dominating set of a graph G with no isolated vertex is a set S of vertices of G such that every vertex is adjacent to a vertex in S. The total domination number of G is the minimum cardinality of a total dominating set in G. In this paper, we present several upper bounds on the total domination number in terms of the minimum degree, diameter, girth and order.
متن کاملA note on the total domination number of a tree
A set S of vertices is a total dominating set of a graph G if every vertex of G is adjacent to some vertex in S. The minimum cardinality of a total dominating set is the total domination number t(G). We show that for a nontrivial tree T of order n and with ` leaves, t(T ) > (n+2 `)=2, and we characterize the trees attaining this lower bound. Keywords: total domination, trees. AMS subject classi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2016
ISSN: 0166-218X
DOI: 10.1016/j.dam.2015.06.029